A Generalization of Probabilistic Serial to Randomized Social Choice
نویسندگان
چکیده
The probabilistic serial rule is one of the most wellestablished and desirable rules for the random assignment problem. We present the egalitarian simultaneous reservation social decision scheme — an extension of probabilistic serial to the more general setting of randomized social choice. We consider various desirable fairness, efficiency, and strategic properties of social decision schemes and show that egalitarian simultaneous reservation compares favorably against existing rules. Finally, we define a more general class of social decision schemes called simultaneous reservation, that contains egalitarian simultaneous reservation as well as the serial dictatorship rules. We show that outcomes of simultaneous reservation characterize efficiency with respect to a natural refinement of stochastic dominance.
منابع مشابه
Maximal Recursive Rule: A New Social Decision Scheme
In social choice settings with strict preferences, random dictatorship rules were characterized by Gibbard [1977] as the only randomized social choice functions that satisfy strategyproofness and ex post efficiency. In the more general domain with indifferences, RSD (random serial dictatorship) rules are the well-known and perhaps only known generalization of random dictatorship. We present a n...
متن کاملProbit-Based Traffic Assignment: A Comparative Study between Link-Based Simulation Algorithm and Path-Based Assignment and Generalization to Random-Coefficient Approach
Probabilistic approach of traffic assignment has been primarily developed to provide a more realistic and flexible theoretical framework to represent traveler’s route choice behavior in a transportation network. The problem of path overlapping in network modelling has been one of the main issues to be tackled. Due to its flexible covariance structure, probit model can adequately address the pro...
متن کاملTotally probabilistic Lp spaces
In this paper, we introduce the notion of probabilistic valued measures as a generalization of non-negative measures and construct the corresponding Lp spaces, for distributions p > "0. It is alsoshown that if the distribution p satises p "1 then, as in the classical case, these spaces are completeprobabilistic normed spaces.
متن کاملIncentives for Participation and Abstention in Probabilistic Social Choice
Preliminaries • A social decision scheme (SDS) is a function that maps a preference profile to a lottery over the alternatives. Formally, an SDS is a function f : RFN → ∆(A). • An SDS is majoritarian if it only depends on the (unweighted) majority comparisons between alternatives. • We compare lotteries using stochastic dominance (SD). A lottery p is preferred to another lottery q if the expe...
متن کاملStrategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
The Gibbard-Satterthwaite Theorem on the manipulability of socialchoice rules assumes resoluteness: there are no ties, no multi-member choice sets. Generalizations based on a familiar lottery idea allow ties but assume perfectly shared probabilistic beliefs about their resolution. We prove a more straightforward generalization that assumes almost no limit on ties or beliefs about them.
متن کامل